A Comparison of BDI Based Real-Time Reasoning and HTN Based Planning
نویسندگان
چکیده
The Belief-Desire-Intention (BDI) model of agency is an architecture based on Bratman’s theory of practical reasoning. Hierarchical Task Network (HTN) decomposition on the other hand is a planning technique which has its roots in classical planning systems such as STRIPS. Despite being used for different purposes, HTN and BDI systems appear to have a lot of similarities in the problem solving approaches they adopt. This paper presents these similarities. A systematic method for mapping between the two systems is developed, and experimental results for different kinds of environments are presented.
منابع مشابه
BDI Agent Reasoning with Guidance from HTN Recipes
Belief-Desire-Intention (BDI) agent systems and Hierarchical Task Network (HTN) planning systems are two popular approaches to acting and planning, both of which are based on hierarchical and context-based expansion of subgoals. Over the past three decades, various authors have recognised the similarities between the two approaches, and developed methods for making the domain knowledge embedded...
متن کاملCase-Based, Decision-Theoretic, HTN Planning
This paper describes ProCHiP, a planner that combines CBR with the techniques of decision-theoretic planning and HTN planning in order to deal with uncertain, dynamic large-scale real-world domains. We explain how plans are represented, generated and executed. Unlike in regular HTN planning, ProCHiP can generate plans in domains where there is no complete domain theory by using cases instead of...
متن کاملOn the Benefit of Fusing DL-Reasoning with HTN-Planning
Keeping planning problems as small as possible is a must in order to cope with complex tasks and environments. Earlier, we have described a method for cascading Description Logic (dl) representation and reasoning on the one hand, and Hierarchical Task Network (htn) action planning on the other. The planning domain description as well as the fundamental htn planning concepts are represented in d...
متن کاملExploiting the Structure of Hierarchical Plans in Temporal Constraint Propagation
Quantitative temporal constraints are an essential requirement for many planning domains. The HTN planning paradigm has proven to be better suited than other approaches to many applications. To date, however, efficiently integrating temporal reasoning with HTN planning has been little explored. This paper describes a means to exploit the structure of a HTN plan in performing temporal propagatio...
متن کاملComposition of Flow-Based Applications with HTN Planning
Goal-driven automated composition of software components is an important problem with applications in Web service composition and stream processing systems. The popular approach to address this problem is to build the composition automatically using Artificial Intelligence planning. However, it is shown that some of these popular planning approaches may neither be feasible nor scalable for many...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004